Solving archaeological puzzles
نویسندگان
چکیده
This paper focuses on the re-assembly of an archaeological artifact, given images its fragments. problem can be considered as a special challenging case puzzle solving. The restricted natural image from square pieces has been investigated extensively and was shown to difficult in own right. Likewise, matching “clean” 2D polygons/splines based solely their geometric properties studied. But what if these ideal conditions do not hold? is addressed paper. Three unique characteristics fragments make solving extremely difficult: (1) are general shape; (2) They abraded, especially at boundaries (where strongest cues for should exist); (3) domain valid transformations between continuous. key contribution this fully-automatic algorithm that addresses intriguing domain. We show our approach manages correctly reassemble dozens broken artifacts frescoes.
منابع مشابه
Techniques for Solving Sudoku Puzzles
Solving Sudoku puzzles is one of the most popular pastimes in the world. Puzzles range in difficulty from easy to very challenging; the hardest puzzles tend to have the most empty cells. The current paper explains and compares three algorithms for solving Sudoku puzzles. Backtracking, simulated annealing, and alternating projections are generic methods for attacking combinatorial optimization p...
متن کاملGenetics in Solving Dyslexia Puzzles
Developmental dyslexia, or specific learning difficulties, is the most common neurobehavioral disorder affecting school-aged children, with a prevalence rate of 5-17.5%. Family and twin studies have pointed to a genetic component in the etiology of dyslexia. However, dyslexia is a complex disorder at both the genetic and environmental levels, and its nature so far remains unclear. Dyslexia is t...
متن کاملA Retrievable GA for Solving Sudoku Puzzles A Retrievable GA for Solving Sudoku Puzzles
In this paper we propose a modification to Genetic Algorithm which we call as Retrievable Genetic Algorithm (Ret-GA) and use it to solve a given Sudoku puzzle. Although a number of approaches exist for solving a given Sudoku puzzle, very few papers with heuristic approaches are available for obtaining its solution. In this work, the fitness function is modeled in a new way considering puzzle-ch...
متن کاملFramework for extracting and solving combination puzzles
This thesis describes and investigates how computer vision algorithms and stereo vision algorithms may be applied to the problem of object detection. In particular, if computer vision can aid on puzzle solving. The idea to use computer application for puzzle solving came from the fact that all solution techniques are algorithms in the end. This fact leads to the conclusion that algorithms are w...
متن کاملSolving Constraint Satisfaction Puzzles with Constraint Programming
Constraint Programming (CP) is a powerful paradigm for solving Combinatorial Problems (generally issued from Decision Making). In CP, Enumeration Strategies are crucial for resolution performances. In this work, we model the known benchmark problems Latin Square, Magic Square and Sudoku as a Constraint Satisfaction Problems. We solve them with Constraint Programming comparing the performance of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Pattern Recognition
سال: 2021
ISSN: ['1873-5142', '0031-3203']
DOI: https://doi.org/10.1016/j.patcog.2021.108065